Minimally Intersecting Set Partitions of Type B
نویسندگان
چکیده
This paper is primarily concerned with the meet structure of the lattice of type Bn partitions of the set {±1, ±2, . . . , ±n}. The lattice of type Bn set partitions has been studied by Reiner [8]. It can be regarded as a representation of the intersection lattice of the type B Coxeter arrangements, see Björner and Wachs [3], Björner and Brenti [2] and Humphreys [6]. A set partition of type Bn is a partition π of the set {±1, ±2, . . . , ±n} into blocks satisfying the following conditions:
منابع مشابه
On Cross-Intersecting Families of Set Partitions
Let B(n) denote the collection of all set partitions of [n]. Suppose A1,A2 ⊆ B(n) are cross-intersecting i.e. for all A1 ∈ A1 and A2 ∈ A2, we have A1 ∩A2 6= ∅. It is proved that for sufficiently large n,
متن کاملIntersecting integer partitions
If a1, a2, . . . , ak and n are positive integers such that n = a1+a2+· · ·+ak, then the sum a1 + a2 + · · ·+ ak is said to be a partition of n of length k, and a1, a2, . . . , ak are said to be the parts of the partition. Two partitions that differ only in the order of their parts are considered to be the same partition. Let Pn be the set of partitions of n, and let Pn,k be the set of partitio...
متن کاملA Deza-Frankl Type Theorem for Set Partitions
A set partition of [n] is a collection of pairwise disjoint nonempty subsets (called blocks) of [n] whose union is [n]. Let B(n) denote the family of all set partitions of [n]. A family A ⊆ B(n) is said to be m-intersecting if any two of its members have at least m blocks in common. For any set partition P ∈ B(n), let τ(P ) = {x : {x} ∈ P} denote the union of its singletons. Also, let μ(P ) = [...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملStrongly intersecting integer partitions
We call a sum a1 + a2 + · · ·+ ak a partition of n of length k if a1, a2, . . . , ak and n are positive integers such that a1 ≤ a2 ≤ · · · ≤ ak and n = a1 + a2 + · · ·+ ak. For i = 1, 2, . . . , k, we call ai the i-th part of the sum a1 + a2 + · · ·+ ak. Let Pn,k be the set of all partitions of n of length k. We say that two partitions a1 + a2 + · · · + ak and b1 + b2 + · · ·+ bk strongly inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010